Tensor-Krylov methods for large nonlinear equations
نویسنده
چکیده
In this paper, we describe tensor methods for large systems of nonlinear equations based on Krylov subspace techniques for approximately solving the linear systems that are required in each tensor iteration. We refer to a method in this class as a tensor-Krylov algorithm. We describe comparative testing for a tensor-Krylov implementation versus an analogous implementation based on a Newton-Krylov method. The test results show that tensor-Krylov methods are much more eecient and robust than Newton-Krylov methods on hard nonlinear equations problems.
منابع مشابه
Tensor-Krylov Methods for Solving Large-Scale Systems of Nonlinear Equations
This paper develops and investigates iterative tensor methods for solving large-scale systems of nonlinear equations. Direct tensor methods for nonlinear equations have performed especially well on small, dense problems where the Jacobian matrix at the solution is singular or ill-conditioned, which may occur when approaching turning points, for example. This research extends direct tensor metho...
متن کاملSolving large systems arising from fractional models by preconditioned methods
This study develops and analyzes preconditioned Krylov subspace methods to solve linear systems arising from discretization of the time-independent space-fractional models. First, we apply shifted Grunwald formulas to obtain a stable finite difference approximation to fractional advection-diffusion equations. Then, we employee two preconditioned iterative methods, namely, the preconditioned gen...
متن کاملKrylov Implicit Integration Factor Methods for Semilinear Fourth-Order Equations
Implicit integration factor (IIF) methods were developed for solving time-dependent stiff partial differential equations (PDEs) in literature. In [Jiang and Zhang, Journal of Computational Physics, 253 (2013) 368–388], IIF methods are designed to efficiently solve stiff nonlinear advection–diffusion–reaction (ADR) equations. The methods can be designed for an arbitrary order of accuracy. The st...
متن کاملKrylov-type methods for tensor computations I
Several Krylov-type procedures are introduced that generalize matrix Krylov methods for tensor computations. They are denoted minimal Krylov recursion, maximal Krylov recursion, and contracted tensor product Krylov recursion. It is proved that, for a given tensor A with multilinear rank-(p, q, r), the minimal Krylov recursion extracts the correct subspaces associated to the tensor in p+ q+r num...
متن کاملAdaptive preconditioners for nonlinear systems of equations
The use of preconditioned Krylov methods is in many applications mandatory for computing efficiently the solution of large sparse nonlinear systems of equations. However, the available preconditioners are often sub-optimal, due to the changing nature of the linearized operator. In this work we introduce and analyze an adaptive preconditioning technique based on the Krylov subspace information g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comp. Opt. and Appl.
دوره 5 شماره
صفحات -
تاریخ انتشار 1996